Spanning Trees in Multipartite Geometric Graphs
نویسندگان
چکیده
منابع مشابه
Maximum Plane Trees in Multipartite Geometric Graphs
A geometric graph is a graph whose vertices are points in the plane and whose edges are straight-line segments between the points. A plane spanning tree in a geometric graph is a spanning tree that is non-crossing. Let R and B be two disjoint sets of points in the plane where the points of R are colored red and the points of B are colored blue, and let n = |R ∪ B|. A bichromatic plane spanning ...
متن کاملEncoding Spanning Trees of Complete Multipartite Graphs Quickly
Deo and Micikevicius recently gave a new bijection for spanning trees of complete bipartite graphs. Their method had advantages of linear running time for encoding and decoding, as well as for computing the diameter, center and radius directly from the encoding without having to construct the tree. In this paper we devise a generalization of Deo and Micikevicius’s method, which also a modificat...
متن کاملPacking Plane Spanning Trees and Paths in Complete Geometric Graphs
We consider the following question: How many edgedisjoint plane spanning trees are contained in a complete geometric graph GKn on any set S of n points in general position in the plane?
متن کاملPacking Short Plane Spanning Trees in Complete Geometric Graphs
Given a set of points in the plane, we want to establish a connection network between these points that consists of several disjoint layers. Motivated by sensor networks, we want that each layer is spanning and plane, and that no edge is very long (when compared to the minimum length needed to obtain a spanning graph). We consider two different approaches: first we show an almost optimal centra...
متن کاملSpanning trees with few crossings in geometric and topological graphs
We study the problem of computing a spanning tree in a connected topological graph such that the number of crossings in the spanning tree is minimum. We show it is NP-hard to find a good approximation of the minimum number of crossings even in geometric graphs. On the other hand we show that the problem is fixed-parameter tractable and present a mixedinteger linear program formulation.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 2017
ISSN: 0178-4617,1432-0541
DOI: 10.1007/s00453-017-0375-4